An ant colony optimization based real-time mobile application for the capacitated vehicle routing problem

نویسندگان

چکیده

This work focuses on the capacitated vehicle routing problem. In this work, a real-time application is developed using online real-world data for mobile devices have IOS and Android operating systems. The fuzzy c-means clustering algorithm used to group demand points ant colony optimization employed determine best route within each group. customer distances between these are obtained via Google Places Directions APIs. deviations in that result from environmental road conditions identified immediately with help of global positioning system technology allowing suggestions be made. was evaluated two datasets testing. test results showed can find optimum problem follow optimally.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization

One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...

متن کامل

APPLICATION of HYBRID ANT COLONY OPTIMIZATION (HACO) AlGORITHM for SOLVING CAPACITATED VEHICLE ROUTING PROBLEM (CVRP)

The Capacitated Vehicle Routing problem (CVRP) is a combinatorial optimization and nonlinear problem seeking to service a number of customers with a fleet of vehicles. CVRP isan important problem in the fields of transportation, distribution and logistics . Usually, the goal is delivering goods located at a central depot to customers who have placed orders. This transportation optimization prob...

متن کامل

Autonomous Units for Solving the Capacitated Vehicle Routing Problem Based on Ant Colony Optimization

Communities of autonomous units and ant colony systems have fundamental features in common. Both consists of a set of autonomously acting units that transform and move around a common environment that is usually a graph. In contrast to ant colony systems, the actions of autonomous units are specified by graph transformation rules which have a precisely defined operational semantics and can be v...

متن کامل

An Ant Colony Algorithm for the Capacitated Vehicle Routing

The Vehicle Routing Problem (VRP) requires the determination of an optimal set of routes for a set of vehicles to serve a set of customers. We deal here with the Capacitated Vehicle Routing Problem (CVRP) where there is a maximum weight or volume that each vehicle can load. We developed an Ant Colony algorithm (ACO) for the CVRP based on the metaheuristic technique introduced by Colorni, Dorigo...

متن کامل

An improved ant colony optimization for vehicle routing problem

The vehicle routing problem (VRP), a well-known combinatorial optimization problem, holds a central place in logistics management. This paper proposes an improved ant colony optimization (IACO), which possesses a new strategy to update the increased pheromone, called ant-weight strategy, and a mutation operation, to solve VRP. The computational results for fourteen benchmark problems are report...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Hitite journal of science and engineering

سال: 2022

ISSN: ['2148-4171', '2149-2123']

DOI: https://doi.org/10.17350/hjse19030000279